0.06/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.12	% Command    : run_E %s %d THM
0.12/0.32	% Computer : n021.cluster.edu
0.12/0.32	% Model    : x86_64 x86_64
0.12/0.32	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.32	% Memory   : 8042.1875MB
0.12/0.32	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.32	% CPULimit   : 1440
0.12/0.32	% WCLimit    : 180
0.12/0.32	% DateTime   : Thu Jul  4 07:19:54 EDT 2024
0.12/0.33	% CPUTime    : 
0.19/0.46	Running higher-order theorem proving
0.19/0.47	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.xVKYRIX1Wh/E---3.1_4991.p
0.19/0.50	# Version: 3.2.0-ho
0.19/0.50	# Preprocessing class: HSSSSMSSSSSNHHA.
0.19/0.50	# Scheduled 5 strats onto 8 cores with 180 seconds (1440 total)
0.19/0.50	# Starting sh2lt with 720s (4) cores
0.19/0.50	# Starting new_ho_10_unif with 180s (1) cores
0.19/0.50	# Starting full_lambda_6 with 180s (1) cores
0.19/0.50	# Starting post_as_ho1 with 180s (1) cores
0.19/0.50	# Starting ehoh_best3_rw with 180s (1) cores
0.19/0.50	# sh2lt with pid 5069 completed with status 0
0.19/0.50	# Result found by sh2lt
0.19/0.50	# Preprocessing class: HSSSSMSSSSSNHHA.
0.19/0.50	# Scheduled 5 strats onto 8 cores with 180 seconds (1440 total)
0.19/0.50	# Starting sh2lt with 720s (4) cores
0.19/0.50	# SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
0.19/0.50	# Search class: HGUNF-FFSF11-SHHFFMBN
0.19/0.50	# Scheduled 6 strats onto 4 cores with 720 seconds (720 total)
0.19/0.50	# Starting ho_unfolding_3 with 389s (1) cores
0.19/0.50	# Starting sh2lt with 73s (1) cores
0.19/0.50	# Starting sh5l with 65s (1) cores
0.19/0.50	# Starting new_bool_3 with 65s (1) cores
0.19/0.50	# sh2lt with pid 5075 completed with status 0
0.19/0.50	# Result found by sh2lt
0.19/0.50	# Preprocessing class: HSSSSMSSSSSNHHA.
0.19/0.50	# Scheduled 5 strats onto 8 cores with 180 seconds (1440 total)
0.19/0.50	# Starting sh2lt with 720s (4) cores
0.19/0.50	# SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
0.19/0.50	# Search class: HGUNF-FFSF11-SHHFFMBN
0.19/0.50	# Scheduled 6 strats onto 4 cores with 720 seconds (720 total)
0.19/0.50	# Starting ho_unfolding_3 with 389s (1) cores
0.19/0.50	# Starting sh2lt with 73s (1) cores
0.19/0.50	# Preprocessing time       : 0.001 s
0.19/0.50	# Presaturation interreduction done
0.19/0.50	
0.19/0.50	# Proof found!
0.19/0.50	# SZS status Theorem
0.19/0.50	# SZS output start CNFRefutation
0.19/0.50	thf(decl_sort1, type, a: $tType).
0.19/0.50	thf(decl_22, type, epred1_0: a > a > $o).
0.19/0.50	thf(decl_23, type, esk1_1: a > a).
0.19/0.50	thf(decl_24, type, epred2_1: ((a > $o) > (a > $o) > $o) > a > $o).
0.19/0.50	thf(decl_25, type, epred3_1: ((a > $o) > (a > $o) > $o) > a > $o).
0.19/0.50	thf(decl_26, type, epred4_1: ((a > $o) > (a > $o) > $o) > a > $o).
0.19/0.50	thf(decl_27, type, epred5_1: ((a > $o) > (a > $o) > $o) > a > $o).
0.19/0.50	thf(decl_28, type, epred6_1: ((a > $o) > (a > $o) > $o) > a > $o).
0.19/0.50	thf(decl_33, type, epred7_0: $o).
0.19/0.50	thf(cTHM165_pme, conjecture, (?[X1:a > a > $o]:(((![X2:a]:(?[X3:a]:((X1 @ X2 @ X3)))&![X2:a]:(~((X1 @ X2 @ X2))))&![X2:a, X4:a, X5:a]:(((X1 @ X2 @ X5)<=((X1 @ X2 @ X4)&(X1 @ X4 @ X5))))))=>?[X6:(a > $o) > (a > $o) > $o]:(((![X7:a > $o]:(~((X6 @ X7 @ X7)))&![X8:a > $o, X9:a > $o, X10:a > $o]:(((X6 @ X8 @ X10)<=((X6 @ X9 @ X10)&(X6 @ X8 @ X9)))))&![X11:a > $o]:(?[X12:a > $o]:((X6 @ X11 @ X12)))))), file('/export/starexec/sandbox/tmp/tmp.xVKYRIX1Wh/E---3.1_4991.p', cTHM165_pme)).
0.19/0.50	thf(c_0_1, negated_conjecture, ~((?[X1:a > a > $o]:(((![X2:a]:(?[X3:a]:((X1 @ X2 @ X3)))&![X2:a]:(~((X1 @ X2 @ X2))))&![X2:a, X4:a, X5:a]:((((X1 @ X2 @ X4)&(X1 @ X4 @ X5))=>(X1 @ X2 @ X5)))))=>?[X6:(a > $o) > (a > $o) > $o]:(((![X7:a > $o]:(~((X6 @ X7 @ X7)))&![X8:a > $o, X9:a > $o, X10:a > $o]:((((X6 @ X9 @ X10)&(X6 @ X8 @ X9))=>(X6 @ X8 @ X10))))&![X11:a > $o]:(?[X12:a > $o]:((X6 @ X11 @ X12))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM165_pme])])).
0.19/0.50	thf(c_0_2, negated_conjecture, ![X28:a, X30:a, X31:a, X32:a, X33:a, X34:(a > $o) > (a > $o) > $o, X40:a > $o]:(((((epred1_0 @ X28 @ (esk1_1 @ X28))&~(epred1_0 @ X30 @ X30))&(~(epred1_0 @ X31 @ X32)|~(epred1_0 @ X32 @ X33)|(epred1_0 @ X31 @ X33)))&((((X34 @ (epred4_1 @ X34) @ (epred5_1 @ X34))|(X34 @ (epred2_1 @ X34) @ (epred2_1 @ X34))|~(X34 @ (epred6_1 @ X34) @ X40))&((X34 @ (epred3_1 @ X34) @ (epred4_1 @ X34))|(X34 @ (epred2_1 @ X34) @ (epred2_1 @ X34))|~(X34 @ (epred6_1 @ X34) @ X40)))&(~(X34 @ (epred3_1 @ X34) @ (epred5_1 @ X34))|(X34 @ (epred2_1 @ X34) @ (epred2_1 @ X34))|~(X34 @ (epred6_1 @ X34) @ X40))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])).
0.19/0.50	thf(c_0_3, negated_conjecture, ![X6:(a > $o) > (a > $o) > $o, X7:a > $o]:(((X6 @ (epred3_1 @ X6) @ (epred4_1 @ X6))|(X6 @ (epred2_1 @ X6) @ (epred2_1 @ X6))|~((X6 @ (epred6_1 @ X6) @ X7)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.19/0.50	thf(c_0_4, negated_conjecture, ![X7:a > $o]:((((epred6_1 @ $neq)=(X7))|((epred4_1 @ $neq)!=(epred3_1 @ $neq)))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]), c_0_3])).
0.19/0.50	thf(c_0_5, negated_conjecture, ![X7:a > $o, X8:a > $o]:((((X7)=(X8))|((epred4_1 @ $neq)!=(epred3_1 @ $neq)))), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_3, c_0_4])])])).
0.19/0.50	thf(c_0_6, negated_conjecture, ![X7:a > $o, X8:a > $o, X49:a]:((((X7 @ X49)<=>(X8 @ X49))|((epred4_1 @ $neq)!=(epred3_1 @ $neq)))), inference(arg_cong,[status(thm)],[c_0_5])).
0.19/0.50	thf(c_0_7, negated_conjecture, ~((epred7_0)), inference(dynamic_cnf,[status(thm)],[c_0_6])).
0.19/0.50	thf(c_0_8, negated_conjecture, ($false), inference(flex_resolve,[status(thm)],[inference(sr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_6]), c_0_7])]), ['proof']).
0.19/0.50	# SZS output end CNFRefutation
0.19/0.50	# Parsed axioms                        : 2
0.19/0.50	# Removed by relevancy pruning/SinE    : 1
0.19/0.50	# Initial clauses                      : 6
0.19/0.50	# Removed in clause preprocessing      : 0
0.19/0.50	# Initial clauses in saturation        : 6
0.19/0.50	# Processed clauses                    : 95
0.19/0.50	# ...of these trivial                  : 11
0.19/0.50	# ...subsumed                          : 5
0.19/0.50	# ...remaining for further processing  : 78
0.19/0.50	# Other redundant clauses eliminated   : 1
0.19/0.50	# Clauses deleted for lack of memory   : 0
0.19/0.50	# Backward-subsumed                    : 3
0.19/0.50	# Backward-rewritten                   : 1
0.19/0.50	# Generated clauses                    : 178
0.19/0.50	# ...of the previous two non-redundant : 163
0.19/0.50	# ...aggressively subsumed             : 0
0.19/0.50	# Contextual simplify-reflections      : 1
0.19/0.50	# Paramodulations                      : 77
0.19/0.50	# Factorizations                       : 2
0.19/0.50	# NegExts                              : 5
0.19/0.50	# Equation resolutions                 : 1
0.19/0.50	# Disequality decompositions           : 0
0.19/0.50	# Total rewrite steps                  : 25
0.19/0.50	# ...of those cached                   : 19
0.19/0.50	# Propositional unsat checks           : 0
0.19/0.50	#    Propositional check models        : 0
0.19/0.50	#    Propositional check unsatisfiable : 0
0.19/0.50	#    Propositional clauses             : 0
0.19/0.50	#    Propositional clauses after purity: 0
0.19/0.50	#    Propositional unsat core size     : 0
0.19/0.50	#    Propositional preprocessing time  : 0.000
0.19/0.50	#    Propositional encoding time       : 0.000
0.19/0.50	#    Propositional solver time         : 0.000
0.19/0.50	#    Success case prop preproc time    : 0.000
0.19/0.50	#    Success case prop encoding time   : 0.000
0.19/0.50	#    Success case prop solver time     : 0.000
0.19/0.50	# Current number of processed clauses  : 62
0.19/0.50	#    Positive orientable unit clauses  : 6
0.19/0.50	#    Positive unorientable unit clauses: 0
0.19/0.50	#    Negative unit clauses             : 48
0.19/0.50	#    Non-unit-clauses                  : 8
0.19/0.50	# Current number of unprocessed clauses: 77
0.19/0.50	# ...number of literals in the above   : 234
0.19/0.50	# Current number of archived formulas  : 0
0.19/0.50	# Current number of archived clauses   : 16
0.19/0.50	# Clause-clause subsumption calls (NU) : 34
0.19/0.50	# Rec. Clause-clause subsumption calls : 33
0.19/0.50	# Non-unit clause-clause subsumptions  : 6
0.19/0.50	# Unit Clause-clause subsumption calls : 1229
0.19/0.50	# Rewrite failures with RHS unbound    : 0
0.19/0.50	# BW rewrite match attempts            : 1
0.19/0.50	# BW rewrite match successes           : 1
0.19/0.50	# Condensation attempts                : 0
0.19/0.50	# Condensation successes               : 0
0.19/0.50	# Termbank termtop insertions          : 19739
0.19/0.50	# Search garbage collected termcells   : 322
0.19/0.50	
0.19/0.50	# -------------------------------------------------
0.19/0.50	# User time                : 0.015 s
0.19/0.50	# System time              : 0.002 s
0.19/0.50	# Total time               : 0.017 s
0.19/0.50	# Maximum resident set size: 1888 pages
0.19/0.50	
0.19/0.50	# -------------------------------------------------
0.19/0.50	# User time                : 0.055 s
0.19/0.50	# System time              : 0.009 s
0.19/0.50	# Total time               : 0.064 s
0.19/0.50	# Maximum resident set size: 1724 pages
0.19/0.50	% E---3.1 exiting
0.19/0.50	% E exiting
0.19/0.50	EOF